Finding the Best Viewpoints for Three-Dimensional Graph Drawings
نویسندگان
چکیده
In this paper we address the problem of nding the best viewpoints for three-dimensional straight-line graph drawings. We deene goodness in terms of preserving the relational structure of the graph, and develop two continuous measures of goodness under orthographic parallel projection. We develop Voronoi variants to nd the best viewpoints under these measures, and present results on the complexity of these diagrams.
منابع مشابه
Two Voronoi Variants with Applications to Viewing Three-Dimensional Graph Drawings
In this paper we address the problem of nding good viewpoints for three-dimensional straight-line graph drawings. We deene goodness in terms of preserving the relational structure of the graph, and develop two continuous measures of goodness. We develop Voronoi variants to nd the best viewpoints under these measures. We conclude by discussing future research and posing some open problems.
متن کاملApproximation Algorithms for Finding Best Viewpoints
We address the problem of nding viewpoints that preserve the relational structure of a three-dimensional graph drawing under or-thographic parallel projection. Previously, algorithms for nding the best viewpoints under two natural models of viewpoint \goodness" were proposed. Unfortunately, the inherent combinatorial complexity of the problem makes nding exact solutions is impractical. In this ...
متن کاملOptimal three-dimensional orthogonal graph drawing in the general position model
Let G be a graph with maximum degree at most six. A three-dimensional orthogonal drawing of G positions the vertices at grid-points in the three-dimensional orthogonal grid, and routes edges along grid lines such that edge routes only intersect at common end-vertices. In this paper, we consider three-dimensional orthogonal drawings in the general position model; here no two vertices are in a co...
متن کاملComplexity Results for Three-Dimensional Orthogonal Graph Drawing
In this paper we consider the problem of finding three-dimensional orthogonal drawings of maximum degree six graphs from the computational complexity perspective. We introduce the 3SAT reduction framework which can be used to prove the NP-hardness of finding three-dimensional orthogonal drawings with specific constraints. By using the framework we show that, given a three-dimensional orthogonal...
متن کاملUpward Three-Dimensional Grid Drawings of Graphs
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges do not cross. Our aim is to produce three-dimensional grid drawings with small bounding box volume. Our first main result is that every nvertex graph with bounded degeneracy has a three-dimensional grid drawing with O...
متن کامل